Optimal Sequential Gossiping by Short Messages

Gossiping is the process of information diiusion in which each node of a network holds a block that must be communicated to all the other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a xed number p of blocks during each call. We study the minimum number of calls necessary to perform gossiping among n processors for any arbitrary xed upper bound on the message size p.